A Six-order Modification of Newton’s Method For Solving Nonlinear Equations

نویسندگان

  • Manoj Kumar Singh
  • S. R. Singh
چکیده

A new six order variant of Newton’s method has been developed by extending a third order method of Ozban [14] and its convergence properties have been discussed. The order of convergence of the proposed method is six. Starting with a suitably chosen x0, the method generates a sequence of iterates converging to the root. The convergence analysis is provided to establish its sixth order of convergence. In terms of computational cost, it requires evaluations of only two functions and two first order derivatives per iteration. This implies that efficiency index of our method is 1.5651. Proposed method is comparable with the methods of Parhi, and Gupta [15] and that of Kou and Li [7]. It does not require the evaluation of the second order derivative of the given function as required in the family of Chebyshev– Halley type methods. The efficiency of the method is tested on a number of numerical examples. It is observed that our method takes less number of iterations than Newton’s method and the other third order variants of Newton’s method. On comparison with the sixth order methods, it behaves either similarly or better for the examples considered. Copyright c © 2011 Yang’s Scientific Research Institute, LLC. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

THE USE OF THE HE'S ITERATION METHOD FOR SOLVING NONLINEAR EQUATIONS USING CADNA LIBRARY

In this paper, we apply the Newton’s and He’s iteration formulas in order to solve the nonlinear algebraic equations. In this case, we use the stochastic arithmetic and the CESTAC method to validate the results. We show that the He’s iteration formula is more reliable than the Newton’s iteration formula by using the CADNA library.

متن کامل

Solving the fractional integro-differential equations using fractional order Jacobi polynomials

In this paper, we are intend to present a numerical algorithm for computing approximate solution of linear and nonlinear Fredholm, Volterra and Fredholm-Volterra  integro-differential equations. The approximated solution is written in terms of fractional Jacobi polynomials. In this way, firstly we define Riemann-Liouville fractional operational matrix of fractional order Jacobi polynomials, the...

متن کامل

A New Modification of the Reconstruction of Variational Iteration Method for Solving Multi-order Fractional Differential Equations

Fractional calculus has been used to model the physical and engineering processes that have found to be best described by fractional differential equations. For that reason, we need a reliable and efficient technique for the solution of fractional differential equations. The aim of this paper is to present an analytical approximation solution for linear and nonlinear multi-order fractional diff...

متن کامل

Convergence of Legendre wavelet collocation method for solving nonlinear Stratonovich Volterra integral equations

In this paper, we apply Legendre wavelet collocation method to obtain the approximate solution of nonlinear Stratonovich Volterra integral equations. The main advantage of this method is that Legendre wavelet has orthogonality property and therefore coefficients of expansion are easily calculated. By using this method, the solution of nonlinear Stratonovich Volterra integral equation reduces to...

متن کامل

Jacobian Computation-free Newton’s Method for Systems of Nonlinear Equations

We propose a modification to Newton’s method for solving nonlinear equations, namely a Jacobian Computation-free Newton’s Method . Unlike the classical Newton’s method, the proposed modification neither requires to compute and store the Jacobian matrix, nor to solve a system of linear equations in each iteration. This is made possible by approximating the Jacobian inverse to a diagonal matrix w...

متن کامل

A MODIFIED STEFFENSEN'S METHOD WITH MEMORY FOR NONLINEAR EQUATIONS

In this note, we propose a modification of Steffensen's method with some free parameters. These parameters are then be used for further acceleration via the concept of with memorization. In this way, we derive a fast Steffensen-type method with memory for solving nonlinear equations. Numerical results are also given to support the underlying theory of the article.  

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011